${\mathbb O}P^2$ bundles in M-theory
نویسندگان
چکیده
منابع مشابه
Constacyclic codes of length $p^sn$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$
Let Fpm be a finite field of cardinality p m and R = Fpm[u]/〈u 〉 = Fpm +uFpm (u = 0), where p is a prime and m is a positive integer. For any λ ∈ Fpm, an explicit representation for all distinct λ-constacyclic codes over R of length pn is given by a canonical form decomposition for each code, where s and n are positive integers satisfying gcd(p, n) = 1. For any such code, using its canonical fo...
متن کاملConstacyclic codes of length $4p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$
Let p be an odd prime, s,m be positive integers and Fpm be the finite field with p m elements. In this paper, we determine all constacyclic codes of length 4p over the finite commutative chain ring R = Fpm + uFpm with unity, where u 2 = 0. We also determine their dual codes and list some isodual constacyclic codes of length 4p over R.
متن کاملM-theory on Complex P bundles and Calabi–Yau Relatives
These are written up notes of the talk I gave at Simons Workshop 2004, based on preprints hep-th/0402153,0403002,0403038 co-authored by J. Gauntlett, J. Sparks, and D. Waldram. I review the construction of some supersymmetric solutions of 11d supergravity of the type AdS5×M6 where M6 are complex P bundles over Kähler four-manifolds, closely resembling twistor spaces. Then I discuss the dualizat...
متن کاملAll $\alpha+u\beta$-constacyclic codes of length $np^{s}$ over $\mathbb{F}_{p^{m}}+u\mathbb{F}_{p^{m}}$
Let Fpm be a finite field with cardinality p and R = Fpm + uFpm with u = 0. We aim to determine all α + uβ-constacyclic codes of length np over R, where α, β ∈ Fpm , n, s ∈ N+ and gcd(n, p) = 1. Let α0 ∈ F ∗ pm and α s 0 = α. The residue ring R[x]/〈x np − α − uβ〉 is a chain ring with the maximal ideal 〈x − α0〉 in the case that x n − α0 is irreducible in Fpm[x]. If x−α0 is reducible in Fpm[x], w...
متن کاملThe MacWilliams identity for $m$-spotty weight enumerator over $\mathbb{F}_2+u\mathbb{F}_2+\cdots+u^{m-1}\mathbb{F}_2$
Past few years have seen an extensive use of RAM chips with wide I/O data (e.g. 16, 32, 64 bits) in computer memory systems. These chips are highly vulnerable to a special type of byte error, called an m-spotty byte error, which can be effectively detected or corrected using byte error-control codes. The MacWilliams identity provides the relationship between the weight distribution of a code an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Number Theory and Physics
سال: 2009
ISSN: 1931-4523,1931-4531
DOI: 10.4310/cntp.2009.v3.n3.a3